Space-time doppler coding schemes for time-selective wireless communication channels

ABSTRACT

Space-time Doppler (STDO) coding techniques are describe for time-selective channels. In particular, a STDO coded system is capable of achieving a maximum Doppler diversity for time-selective frequency-flat channels. As demonstrated herein, this maximum diversity may be represented as Q+1, where Q is the number of bases in a generalized Basis Expansion Model (BEM) for time-frequency selective channels. In addition, linearly precoded transmissions are described to collect this maximum diversity gain.

[0001] This application claims priority from U.S. Provisional Application Serial No. 60/374,886, filed Apr. 22, 2002, U.S. Provisional Application Serial No. 60/374,935, filed Apr. 22, 2002, U.S. Provisional Application Serial No. 60/374,934, filed Apr. 22, 2002, U.S. Provisional Application Serial No. 60/374,981, filed Apr. 22, 2002, U.S. Provisional Application Serial No. 60/374,933, filed Apr. 22, 2002, the entire contents of which are incorporated herein by reference.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

[0002] This invention was made with Government support under Contract No. #CCR-0105612, awarded by the National Science Foundation, and Contract No. DAAD19-01-2-011 (University of Delaware Subcontract No. 497420) awarded by the U.S. Army. The Government may have certain rights in this invention.

TECHNICAL FIELD

[0003] The invention relates to communication systems and, more particularly, transmitters and receivers for use in wireless communication systems.

BACKGROUND

[0004] Broadband wireless communications call for high data-rate and high performance. Temporal channel variations and time-selective fading, however, may result in lower data-rate and an overall decrease in system performance. Time-selectivity may arise for a variety of reasons, such as oscillator drifts, phase noise, multipath propagation, and relative motion between the transmitter and the receiver. Therefore, it is important for broadband wireless applications to design single- or multi-antenna systems that account for time-varying channels.

SUMMARY

[0005] In general, space-time doppler (STDO) coding techniques are described for time-selective channels. In particular, the described STDO coded system is capable of achieving a maximum Doppler diversity for time-selective frequency-flat channels.

[0006] As demonstrated herein, this maximum diversity may be represented as Q+1, where Q is the number of bases in a generalized Basis Expansion Model (BEM) for time-frequency selective channels. In addition, linearly precoded transmissions are described to collect this maximum diversity gain.

[0007] The STDO coded design utilizes knowledge of a maximum Doppler spread at the transmitter. For exemplary purposes, three STDO codes are described. Each is capable of collecting the maximum STDO diversity. In addition, each offers a uniquely desirable tradeoff among: high spectral efficiency, low decoding complexity, and high coding gain.

[0008] The first STDO codec comprises a digital phase sweeping (DPS) scheme that renders the set of time-selective fading multi-antenna channels mathematically equivalent to a single combined channel offering the maximum joint STDO diversity. The other two STDO codecs are block orthogonal designs, and emerge from a simple but neat duality property that we establish between the time-selectively captured by the BEM, and the frequency-selectivity that can be approximated well by a finite impulse response (FIR) tapped delay line model. This duality property underpins the transformation of ST designs for single- and multi-carrier transmissions over frequency-selective channels to our time-selective channels parameterized by the BEM.

[0009] In one embodiment, a wireless communication device comprises a first coder, a second coder, and an antenna. The first coder linearly precodes a data stream to produce a precoded data stream. The second coder processes the precoded data stream in accordance with a doppler spread of time-selective communication channels to produce a transformed data stream. The antenna outputs a waveform in accordance with the transformed data stream.

[0010] In another embodiment, a wireless communication device comprises a demodulator and a decoder. The demodulator receives a waveform from a plurality of time-selective multipath communication channels and produces a demodulated data stream. The decoder decodes the demodulated data in accordance with a Basis Expansion Model (BEM) that parameterizes time-selective communication multi-path channels as a function of frequency-selective multi-path communication channels.

[0011] In another embodiment, a method comprises estimating a doppler spread for a plurality of channels from a transmitter to a receiver, and applying a linear precoder to a data stream to form a precoded data stream. The method further comprises processing the precoded data stream in accordance with the doppler spread to produce a transformed data stream; and transmitting a waveform with an antenna in accordance with the transformed data stream.

[0012] In another embodiment, a computer-readable medium comprises instructions to cause a programmable processor to estimate a doppler spread for a plurality of channels from a transmitter to a receiver, and apply a linear precoder to a data stream to form a precoded data stream. The instructions further cause the processor to process the precoded data stream in accordance with the doppler spread to produce a transformed data stream, and transmit a waveform with an antenna in accordance with the transformed data stream.

[0013] The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.

BRIEF DESCRIPTION OF DRAWINGS

[0014]FIG. 1 is a block diagram illustrating an exemplary telecommunication system in which a transmitter and receiver implement the space-time Doppler (STDO) coding techniques described herein.

[0015]FIG. 2 illustrates digital phase sweeping (DPS) techniques.

[0016]FIG. 2A is a flowchart that illustrates exemplary operation of the transmitter and receiver of FIG. 1.

[0017]FIG. 3 illustrates channel matrix partitioning.

[0018]FIG. 4 is a block diagram illustrating an example CP-based STDO transceiver.

[0019]FIG. 5 is a block diagram illustrating an example ZP-based STDO transceiver.

[0020] FIGS. 6-10 are graphs that illustrate exemplary results of simulations of the described techniques.

DETAILED DESCRIPTION

[0021]FIG. 1 is a block diagram illustrating a telecommunication system 2 in which transmitter 4 communicates data to receiver 6 through wireless channels 8. In general, transmitter 4 employs space-time doppler (STDO) coding techniques to achieve a maximum doppler diversity for time-selective channels 8.

[0022] Transmitter 4 includes a plurality of antennas 20 ₁-20 _(Nt) for transmitting data to receiver 6. In particular, each antenna 20 outputs a waveform that propagates to receiver 6 through one or more multi-path communication channels. Transmitter 4 may output the waveforms using one of a number of conventional multi-user transmission formats, including Code Division Multiple Access (CDMA) and Orthogonal Frequency Division Multiplexing (OFDM). The former is an example of single-carrier multiple access scheme, while the latter is a multi-carrier scheme. OFDM has been adopted by many standards including digital audio and video broadcasting (DAB, DVB) in Europe and high-speed digital subscriber lines (DSL) in the United States. OFDM has also been proposed for local area mobile wireless broadband standards including IEEE802.11a, IEEE802.11g, MMAC and HIPERLAN/2.

[0023] The techniques described herein may be applied to uplink and/or downlink transmissions, i.e., transmissions from a base station to a mobile device and vice versa. Consequently, transmitters 4 and receivers 6 may be any device configured to communicate using a multi-user wireless transmission including a cellular distribution station, a hub for a wireless local area network, a cellular phone, a laptop or handheld computing device, a personal digital assistant (PDA), and the like.

[0024] As illustrated, transmitter 4 includes an outer space-time linear coder (OSTDO coder) 16, a middle space-time doppler coder (MSTDO coder) 17, a set of inner space-time doppler coders (ISTDO coder) 22, a plurality of parallel-to-serial (P/S) converters 18 ₁-18 _(Nt)., and a plurality of transmit antennas 20 ₁-20 _(Nt). Receiver 6 includes a plurality of receive antennas 28 ₁-28 _(Nr), a plurality of inner space-time decoders (ISTDO coder) 32 ₁-32 _(Nr), a middle space-time doppler coder (MSTDO coder) 34, and an outer space-time doppler coder (STDO coder) decoder 36.

[0025] Channels 8 experience multipath propagation, i.e., a number of reflected or scattered rays arrive at the receiving end. Time-selectivity arises when all the rays arrive at the receiver almost simultaneously with a common propagation delay that can be set to zero without loss of generality. Let h(t) denote the time-varying impulse response of the resulting channel that includes transmit-receive filters as well as time-selective propagation effects; and let H(f) denote the Fourier transform of h(t). Although the bandwidth of h(t) over a finite time horizon is theoretically infinite, we practically have that H(f)=0 for f ∉ [−f_(maxT)f_(max)], where f_(max) is the maximum frequency offset (Doppler shift) of all the rays. Considering that a block of N symbols with symbol period T_(a) is time-limited, we sample H(f) along f with period l/(NT_(a)), and collect Q+1 samples {H(q/(NT_(s)))}_(q = −Q/2)^(Q/2),

[0026] where Q:=2┌f_(max)T_(a)N┐. Transforming these frequency-domain samples back to the time-domain and sampling along the time t, we obtain samples h(n). Using the serial index n, we can describe the block index as └n/N┘, and write our discrete-time baseband equivalent channel model as: $\begin{matrix} {{{h(n)} = {\sum\limits_{q = 0}^{Q}{{h_{q}\left( \left\lfloor {n/N} \right\rfloor \right)}^{j\quad {\omega_{0}{({n\quad {mod}\quad N})}}}}}},} & (1) \end{matrix}$

[0027] where w_(q):=2π(q-Q/2)/N. Eq. (1) constitutes our Basis Expansion Model (BEM). Over each interval, say the kth (k:=└n/N┘), the BEM represents h(t) for t ∈ [kNT_(a)(k+1)NT_(a)) using:

[0028] a) Q+1 coefficients {h_(q)(k)}_(q=0) ^(Q) that remain invariant per block, but are allowed to change with k; and,

[0029] b) Q+1 Fourier bases that capture even rapid time variations, but are common ∀k.

[0030] The complex exponential bases allow h(n) to vary not only across blocks, but also within every block. Notice also that the only physical parameter dictating the BEM order Q is the Doppler spread f_(max), since N and T_(a) in Q:=2┌f_(max)NT_(a)┐ are up to the designer's choice.

[0031] The information bearing symbols {s(n)} are drawn from a finite alphabet A

, and parsed into blocks of size P×1: s(k):=[s(kP), . . . , s((k+1)P−1)]^(T). Each block s(k) is linearly preceded by the K×P matrix Θ, resulting into u(k):=Θs(k). This operation will be termed the outer Space-Time-Doppler (STDO) coding. Each block u(k) is further transformed into N₂ blocks {c_(μ)(k)}_(μm1) ^(Nt) of size N×1 by a mapper M(.): {c_(μ)(k)}_(M(u(k)). This operation will be termed the middle STDO coding. Each block c) _(μ)(k) is finally linearly processed by the N×N matrix Φ_(μ) resulting into v_(μ)(k) :=Φ_(μ)c_(μ)(k). This operation will be termed the inner STDO coding. Not all specific STDO designs will rely on all three (outer, middle, inner) stages of our unifying structure. If one, e.g., the inner stage is inactive, we will simply set Φ_(μ)=I_(μ).

[0032] The sequence v_(μ)(n) obtained by serial-to-parallel converting the blocks {v_(μ)(k)} is then pulse-shaped, carrier modulated, and transmitted from the μth transmit-antenna. The nth sample at the νth antenna's receive-filter output is: ${{x_{\mu}(n)} = {{\sum\limits_{\mu = 1}^{N_{t}}\quad {{h^{\lbrack{v,\mu}\rbrack}(n)}{v_{\mu}(n)}}} + {\zeta_{v}(n)}}},{\forall{v \in \left\lbrack {1,N_{r}} \right\rbrack}},$

[0033] where h^((p,μ))(n) is the time-selective channel response from the μth transmit-antenna to the νth receive-antenna (notice the channel dependence on n), and ζ_(ν)(n) is complex additive white Gaussian noise (AWGN) at the νth receive-antenna with mean zero, and variance σ_(ζ) ²=No. According to (1), we have ∀v∈[1,N

],μ∈[1,N

] ${{h^{\lbrack{v,\mu}\rbrack}(n)}:={\sum\limits_{q = 0}^{Q}{{h_{q}^{({v,\mu})}\left( \left\lfloor {n/N} \right\rfloor \right)}^{j\quad {\omega_{0}{({n\quad {mod}\quad N})}}}}}},$

[0034] where w_(q):=2π(q−Q/2)/N, and Q:=2┌f_(max)NT_(a)┐ as in (1).

[0035] At each receive-antenna, the symbol rate sampled sequence x_(ν)(i) at the receive-filter output is serial-to-parallel converted to form the N×1 blocks x_(ν)(k) :=[x_(p)(kN),x_(v)(kN+1), . . . , x_(v)(kN+N−1)]^(T). The matrix-vector counterpart of (2) can then be expressed as: ${{x_{v}(k)} = {{\sum\limits_{\mu = 1}^{N_{t}}\quad {{D_{H}^{\lbrack{v,\mu}\rbrack}(k)}{v_{\mu}(k)}}} + {\zeta_{v}(k)}}},{\forall{v \in \left\lbrack {1,N_{r}} \right\rbrack}},$

[0036] where D_(H) ^((υ,μ))(k) is an N×N diagonal channel matrix that obeys the BEM ${{D_{H}^{\lbrack{v,\mu}\rbrack}(k)}:={\sum\limits_{q = 0}^{Q}{{h_{q}^{({v,\mu})}(k)}D_{q}}}},$

[0037] with D_(q):=diag[1,exp(jw_(q)), . . . , exp(jw_(q)(N−1))], and ζ_(ν)(k)'s independent identically distributed (i.i.d.) AWGN noise vectors, which are defined similar to x_(ν)(k). Each block x_(p)(k) is linearly processed by the N×N matrix T_(ν)to yield y_(ν)(k) :=T_(ν)x_(ν)(k). This operation is termed the inner STDO decoding. The blocks y_(ν)(k) are further “de-mapped” to a block z(k), by {overscore (M)}(·): z(k) :={overscore (M)}({y_(p)(k)}_(μm1) ^(Nt)). This operation is termed the middle STDO decoding. The block z(k) is finally decoded by

(·) to obtain an estimate of s(k) as: s(k) :=

(z(k)). This operation is termed the outer STDO decoding.

[0038] The following operating conditions are assumed for system 2:

[0039] A2) BEM coefficients h_(z) ^((ν,μ)) are zero-mean, complex Gaussian random variables;

[0040] A3) Channel state information (CSI) is available at the receiver, but unknown at the transmitter;

[0041] A4) High SNR is considered for deriving the STDO diversity and coding gains.

[0042] When transmissions experience rich scattering, and no line-of-sight is present, the central limit theorem validates A2). Notice that we allow not only for independent random channel coefficients, but also for correlated ones.

[0043] Pairwise error probability (PEP) to design our optimality criteria. Define the PEP P(s→s′|D_(H) ^((ν,μ)), ∀ν, μ) as the probability that maximum likelihood (ML) decoding of s erroneously decides s′ instead of the actually transmitted s.

[0044] As x_(ν)in (3) depends on s, we will use ML decoding to detect s from {x_(ν)}_(ν=1) ^(Nr). Conditioned on the D_(H) ^((ν,μ))'s, the Chernoff bound yields: $\begin{matrix} {{{P\left( {{\left. s\rightarrow s^{\prime} \right.D_{H}^{\lbrack{v,\mu}\rbrack}},{\forall v}\quad,\mu} \right)} \leq {\exp \left( {- \frac{d^{2}\left( {\overset{\sim}{x},{\overset{\sim}{x}}^{\prime}} \right)}{4N_{0}}} \right)}},} & (5) \end{matrix}$

[0045] where {tilde over (x)} :=[(Σ_(μ=1) ^(Nt)D_(H) ^((1,μ))v_(μ))^(T), . . . , (Σ_(μ=1) ^(Nt)D_(H) ^((N) ^(_(r)) ^(,μ))v_(μ))^(T)]^(T), the distance in the exponent is ${{d^{2}\left( {\overset{\sim}{x},{\overset{\sim}{x}}^{\prime}} \right)} = {\sum\limits_{v = 1}^{N_{r}}\quad {{\sum\limits_{\mu = 1}^{N_{t}}\quad {D_{H}^{\lbrack{v,\mu}\rbrack}e_{\mu}}}}^{2}}},$

[0046] and e_(μ):=v_(μ)−v′_(μ). Based on (4), and using the commutativity between a diagonal matrix and a vector we can write D_(H) ^((ν,μ))e_(μ)=D_(e) ^((μ))d_(H) ^((ν,μ)), with D_(e) ^((μ)) :=diag[e_(μ)], d_(H) ^((ν,μ)) :=Σ_(q=0) ^(Q)h_(q) ^((ν,μ))w_(q), and w_(q) :=[1, exp(jw_(q)), . . . , exp(jw_(q)(N−1))]^(T). With these definitions, we can rewrite d²({tilde over (x)},{tilde over (x)}′) as:

d²({tilde over (x)},{tilde over (x)}′)=h^(H)A_(c)h,

[0047] where

h:=[h₀ ^((1,1)), . . . , h_(Q) ^((1,1)), . . . , h_(Q) ^((1,Nt)), . . . , h_(Q) ^((Nr,Nt))]^(T), N_(r)N_(t)(Q+1)×1

A_(e) :=I_(Nr){circle over (x)} (Φ_(e) ^(H)Φ_(e)), N_(r)N_(t)(Q+1)×N_(r)N_(t)(Q+1)

Φ_(e) :=[D_(c) ⁽¹⁾Ω, . . . , D_(e) ^((Nt))Ω], N×N_(t)(Q+1)

Ω :=[w₀, . . . , w_(Q)]. N×(Q+1)  (6)

[0048] Since our analysis will allow for correlated channels, we will denote the N_(t)N_(r)(Q+1)×N_(t)N_(r)(Q+1) channel correlation matrix and its rank, respectively, by:

R_(h) :=E[hh^(H)], and T_(h) :=rank(R_(h))≦N_(t)N_(r)(Q+1).  (7)

[0049] Eigenvalue decomposition of R_(h) yields R_(h)=U_(h)Λ_(h)U_(h) ^(H), where Λ_(h) :=diag[σ₀ ², . . . , σ_(r) _(h) ²−1], and U_(h) is an N_(t)N_(r)(Q+1)×r_(h) para-unitary matrix satisfying U_(h) ^(H)U_(h)=I_(r) _(h) . Define an r_(h)×1 normalized channel vector {overscore (h)} with entries {overscore (h)}_(q) ^((ν,μ)) are that i.i.d. Gaussian distributed, with zero mean and unit variance. It is easy to show that h and U_(h)Λ_(h) ^(1/2){overscore (h)} have identical distributions. Therefore, the PEP remains statistically invariant when one replaces h by U_(h)Λ_(h) ^(1/2){overscore (h)}. To proceed, let us define the r_(h)×r_(h) matrix:

Ψ_(e) :=(U_(h)Λ_(h) ^(1/2))^(H)A_(c)U_(h)Λ_(h) ^(1/2).  (8)

[0050] Since Ψ_(e) is Hermitian, there exists a unitary matrix U_(e), and a real non-negative definite diagonal matrix Λ_(e) so that U_(e) ^(H)Ψ_(e)U_(e)=Λ_(e). The r_(h)×r_(h) diagonal matrix Λ_(e) :=diag[λ₀, . . . , λ_(r) _(h) −1], holds on its diagonal the eigenvalues of Ψ_(e), that satisfy λ_(m)≧0, ∀m ∈ [0, r_(h)−1]. The vector {overscore (h)}=U_(e){overscore (h)} has the same distribution as {overscore (h)}, because U_(e) is unitary. Thus, d²({overscore (x)},{overscore (x)}′) can be rewritten in terms of the eigenvalues of the matrix Ψ_(e) as $\begin{matrix} {{d^{2}\left( {\overset{\sim}{x},{\overset{\sim}{x}}^{\prime}} \right)} = {\sum\limits_{m = 0}^{\tau_{h} - 1}{\lambda_{m}{{{\overset{\sim}{h}}_{m}}^{2}.}}}} & (9) \end{matrix}$

[0051] Since we wish our STDO coders to be independent of the particular channel realization, it is appropriate to average the PEP over the independent Rayleigh distributed |{overscore (h)}_(m)|²'s. If r_(e) :=rank(Ψ_(e)), then r_(e) eigenvalues of Ψ_(e) are non-zero; without loss of generality, we denote these eigenvalues as λ₀≧ . . . ≧λ_(r) _(e) −1. At high SNR, the resulting average PEP is bounded as follows [c.f. (5)]: $\begin{matrix} {{{{P\left( s\rightarrow s^{\prime} \right)} \leq {\prod\limits_{m = 0}^{r_{e} - 1}\quad \left( \frac{\lambda_{m}}{4\quad N_{0}} \right)^{- 1}}} = \left( {G_{e,c}\frac{1}{4N_{0}}} \right)^{- G_{e,d}}},} & (10) \end{matrix}$

[0052] where G_(e,d) :=r_(e) is the diversity order, and G_(e) ₁ _(c):=(

^(r) ^(_(c)) ⁻¹ _(m=0)λ_(m)

is the coding gain for the error pattern e :=s−s′. Accounting for all possible pairwise errors, the diversity and coding gains for out STDO multi-antenna systems are defined, respectively, as: $\begin{matrix} {{G_{d}:={\min\limits_{\forall{e \neq 0}}\quad G_{e,d}}},{{{and}\quad G_{c}}:={\min\limits_{\forall{e \neq 0}}\quad {G_{e,c}.}}}} & (11) \end{matrix}$

[0053] Because the performance of STDO depends on both G_(d) and G_(e), it is important to maximize both of them. But before specializing to particular STDO designs that accomplish this, we wish to quantify the maximum possible G_(d) and G_(c) supplied by our BEM.

[0054] Eq. (10) discloses that G_(d) depends on the rank r_(e) of Ψ_(e). As the rank can not exceed the dimensionality, checking the dimensionality of Ψ_(e), we recognize that by appropriately designing our transmission, it is possible to achieve a maximum (and thus optimum) diversity gain $\begin{matrix} {{G_{d}^{\max} = {r_{h} \leq {N_{t}{N_{r}\left( {Q + 1} \right)}}}},} & (12) \end{matrix}$

[0055] if and only if the matrix Ψ_(e) in (8) has full rank r_(h), ∀e≠0.

[0056] Eq. (10) also indicates that G_(e,c) is the product of the non-zero eigenvalues of Ψ_(e). It is not easy however, to express G_(c) in closed form. But we can benchmark it, when R_(h) has full rank N_(r)N_(t)(Q+1).

[0057] Since R_(h) is not known at the transmitter, we will allocate the transmit-power equally to the N_(t) sub-streams corresponding to the N_(t) transmit-antennas. For this reason, we set $\begin{matrix} {{{E\left\lbrack {v_{\mu}^{\mathcal{H}}v_{\mu}} \right\rbrack} = {{\frac{1}{N_{t}}{E\left\lbrack {s^{\mathcal{H}}s} \right\rbrack}} = {\frac{P}{N_{t}}\sigma_{s}^{2}}}},} & (13) \end{matrix}$

[0058] where σ_(s) ² is the power per information symbol. If the mapping from s to v_(μ)satisfies $\begin{matrix} {{v_{\mu} = {{\sum\limits_{p = 0}^{P - 1}\quad {a_{p}^{(\mu)}\lbrack s\rbrack}_{p}} + {b_{p}^{(\mu)}\lbrack s\rbrack}_{p}^{*}}},{\forall{\mu \in \left\lbrack {1,N_{t}} \right\rbrack}},} & (14) \end{matrix}$

[0059] where a_(p) ^((μ)) and b_(p) ^((μ)) are N×1 vectors, then we call this ST transmitter a linearly coded one. $\begin{matrix} {{G_{c}^{\max} = {\left( {\det \quad \left( R_{h} \right)} \right)^{\frac{1}{r_{h}}}\frac{d_{\min}^{2}}{N_{t}}}},} & (15) \end{matrix}$

[0060] where d_(min) is the minimum Euclidean distance of the constellation points in the finite alphabet A_(s).

[0061] In deriving performance bounds, we have assumed ML decoding which comes with high computational complexity. Therefore, when we design the STDO encoders to guarantee the maximum diversity order, we will keep in mind the need to reduce decoding complexity while preserving the optimality in decoding. Before we proceed to design STDO coders, we summarize our results so far in the following proposition:

[0062] Proposition 1 Consider (N_(t),N_(r)) multi-antenna transmissions through time-selective channels adhering to a BEM as in (1) with Q+1 bases. If the correlation matrix of the channel coefficients in (6) has rank r_(h), then the maximum diversity order of transmissions in (3) is G_(d)^(max) = r_(h) ≤ N_(t)N_(r)(Q + 1).

[0063] For linearly coded systems, if R_(h) has full rank r_(h)=N_(r)N_(t)(Q+1), then the maximum coding gain is $G_{c}^{\max} = {\left( {\det \left( R_{h} \right)} \right)^{\overset{\bot}{r_{h}}}{d_{\min}^{2}/{N_{t}.}}}$

[0064] For the DPS method, the middle STDO encoder M(·) is just a power splitter (see FIG. 1). By equally allocating the signal power, we obtain c_(μ)=u/{square root}{square root over (N)}_(t), ∀μ∈ [1, N_(t)]. This means that for DPS we have K=N. Using (3), x_(ν)and s can then be related via: $\begin{matrix} {{x_{v} = {{\frac{1}{\sqrt{N_{t}}}{\sum\limits_{\mu = 1}^{N_{t}}\quad {D_{H}^{({v,\mu})}\Phi_{\mu}\Theta \quad s}}} + \zeta_{v}}},\quad {v \in {\left\lbrack {1,N_{r}} \right\rbrack.}}} & (16) \end{matrix}$

[0065] Observing (4), we notice that different channels share the same exponential bases, but they have different channel coefficients. Suppose that we shift the Q+1 bases of each chamnel corresponding to one of the N_(t) transmit antennas so that all the bases are consecutive on the FFT grid of complex exponentials, as shown in FIG. 2 for Q+1=N_(t)=3. Then we can view the N_(t) channels to each receive-antenna as one equivalent time-selective channel with N_(t)(Q+1) bases. To realize this intuition, we select the matrices {Φ_(μ)}_(μ=1) ^(Nt), which determine the inner STDO encoder, as

Φ_(μ)=diag[1,e^(jφμ), . . . , e^(jφμ(N−1))], ∀μ∈ [1, N_(t)],  (17)

[0066] where φ_(μ)=2π(μ−1)(Q+1)/N. As Φ₁=I, the exponentials of the channel corresponding to the first (μ=1) transmit antenna remain unchanged. But those corresponding to the second channel (μ=2) are shifted from their original location in {D_(q)}_(q = 0)^(Q)  to  {D_(q)}_(q = Q + 1)^(2Q + 1),

[0067] after multiplication with the DPS matrix Φ₂ that takes place at the second transmit-antenna; i.e., {D_(q)Φ₂}_(q = 0)^(Q) = {D_(q)}_(q = Q + 1)^(2Q + 1).

[0068] Proceeding likewise with all N_(t) DPS matrices, it follows that Eq. (16) can be rewritten as $\begin{matrix} {{x_{v} = {{\frac{1}{\sqrt{N_{t}}}{\sum\limits_{q = 0}^{{N_{t}{({Q + 1})}} - 1}\quad {h_{q}^{(v)}D_{q}\Theta \quad s}}} + \zeta_{v}}},\quad {\forall{v \in \left\lbrack {1,N_{r}} \right\rbrack}},} & (18) \end{matrix}$

[0069] where h_(q)^((v)) := h_(q  mod  (Q + 1))^((v  _(t)⌊q/(Q + 1)⌋ + 1)).

[0070] Comparing (16) with (18), we arrive at:

[0071] Property 1: DPS converts the N_(t) transmit-antenna system, where each channel can be expressed via Q+1 exponential bases, to a single transmit-antenna system, where the equivalent channel is expressed by N_(t)(Q+1) exponential bases.

[0072] Notice that since Φ_(μ) operates in the digital domain, the sweeping wraps the phases around (−π,π) which explains why DPS does not incur bandwidth expansion.

[0073] Remark 1 To avoid overlapping the shifted bases, we should make sure that N>N_(t)(Q+1). From the definition of Q :=2┌f_(max)NT_(s)┐, we have that for fixed f_(max) and N, we can adjust sampling period T_(s) to satisfy this condition. As for each receive-antenna, we have N_(t)(Q+1) unknown BEM coefficients corresponding to N_(t) channels every N symbols, this condition guarantees that the number of unknowns is less than the number equations. Therefore, even from a channel estimation point of view, this condition is reasonable.

[0074] With the equivalence established by Property 1, our outer STDO codec, which is determined by Θ and

(·), can be any single-input codec that achieves the maximum diversity gain for the single transmit-antenna time-selective channels corresponding to each receive-antenna. From [16, Proposition 2], we know that ML decoding by means of

(·) achieves the maximum diversity gain r_(h) if the linear precoder Θ is designed in such a way that Θe has at least N_(t)(Q+1) non-zero entries, for all possible error vectors e=s−s′≠0. However, as N_(t) increases, the block length N increases as well (see Remark 1). ML decoding for the entire N×1 block entails high computational complexity. To reduce the decoding complexity, we will split the design of the outer STDO encoder Θ in groups of smaller size.

[0075] In particular, we design Θ using a Grouped Linear Constellation Precoding (GLCP) scheme described in U.S. Provisional Application Serial No. 60/374,935, entiled “LINEAR CONSTELLATION PRECODING FOR FADING COMMUNICATION CHANNELS,” filed Apr. 22, 2002, and U.S. patent application Ser. No. ______, filed Apr. 21, 2003, entitled “WIRELESS COMMUNICATION SYSTEM HAVING LINEAR ENCODER,” the entire contents of which are incorporated herein by reference.GLCP provides a means of reducing decoding complexity without sacrificing diversity. Here, we design the outer STDO coder 16 based on the BEM for time-selective channels described herein. In particular, we select the transmitted block size N=N_(g)N_(sub), and demultiplex the information vector s into N_(g) groups: {s_(g)}_(g=0) ^(N) ^(_(g)) ⁻¹. Each group has length N_(sub), and contains the symbols collected in a vector s_(g) as follows:

s_(g)=[[s]_(N) _(sub) g, . . . , [s]_(N) _(sub) _((g+1)−1)]^(T), ∀g ∈[0, N_(g)−1].  (19)

[0076] Correspondingly, we define the linearly precoded block of the gth group as:

u_(g)=Θ_(sub)s_(g), ∀g ∈[0, N_(g)−1],  (20)

[0077] where Θ_(sub) is an N_(sub)×N_(sub) matrix. The overall transmitted block u consists of multiplexed sub-blocks {u_(g)}_(g=0) ^(N) ^(_(g)) ⁻¹ as follows:

u=[[u₀]₀, . . . , [u_(N) _(g) ⁻¹]₀; . . . ; [u₀]_(N) _(sub) ⁻¹, . . . , [u_(N) _(g) ⁻¹]_(N) _(sub) ⁻¹]^(T).  (21)

[0078] Notice that u can be obtained from {u_(g)}_(g=0) ^(N) ⁻¹'s via a block interleaver with depth N_(sub), Equivalently, we can relate u with s as $\begin{matrix} {{u = {\Theta \quad s}},{{{with}\quad \Theta}:=\begin{bmatrix} \begin{matrix} {I_{N_{g}} \otimes \theta_{1}^{T}} \\ \vdots \end{matrix} \\ {I_{N_{g}} \otimes \theta_{N_{sub}}^{T}} \end{bmatrix}},} & (22) \end{matrix}$

[0079] where θ_(m) ^(T) is the mth row of Θ_(sub). Equations (19)-(21), or equivalently (22), summarize our STDO transmitter design based on DPS.

[0080] Following the “reverse order” of DPS encoding, we start from the inner decoder. The inner decoder for the νth receive antenna is designed as T_(ν)=I_(N), ∀ν∈[1, N_(r)]. Hence, in the unifying block-diagram of FIG. 1, we have y_(ν)=x_(ν), ∀ν∈[1, N_(r)]. Let us denote the equivalent faster single transmit-antenna channel matrix as: $\begin{matrix} {{D_{H}^{(v)} = {\sum\limits_{q = 0}^{{N_{t}{({Q + 1})}} - 1}\quad {h_{q}^{(v)}D_{q}}}},\quad {\forall{v \in {\left\lbrack {1,N_{r}} \right\rbrack.}}}} & (23) \end{matrix}$

[0081] Since the received blocks y_(ν)from all N_(r) receive-antennas contain the information block s, we need to combine the information from all received blocks to decode s. To retain decoding optimality, we choose the maximum ratio combining (MRC) method. The MRC for x_(ν)=y_(ν)in (18), amounts to selecting the middle decoder {overscore (M)}(·) as [c.f. (23)] $\begin{matrix} {G = {{\left( {\sum\limits_{v = 1}^{N_{r}}\quad {D_{H}^{(v)}\left( D_{H}^{(v)} \right)}^{*}} \right)^{- \frac{1}{2}}\left\lbrack {\left( D_{H}^{(1)} \right)^{*}\quad \ldots \quad \left( D_{H}^{(N_{r})} \right)^{*}} \right\rbrack}.}} & (24) \end{matrix}$

[0082] Existence of the inverse in (24), requires (only for the DPS design) the channels to satisfy: $\begin{matrix} {{{{Channels}\quad D_{H}^{(v)}\quad {are}\quad {coprime}};{i.e.}},{{\det \quad \left( {\sum\limits_{v = 1}^{N_{r}}\quad {D_{H}^{(v)}\left( D_{H}^{(v)} \right)}^{*}} \right)} \neq 0.}} & \left. {A5} \right) \end{matrix}$

[0083] Assumption A5) is more technical rather than restrictive, since it requires that not all equivalent channels are identically zero at the same time slot. For random channels, A5) excludes an event with probability measure zero.

[0084] With the MRC of (24), the output z of {overscore (M)}(·), is given by: $\begin{matrix} {{z = {{G\quad\begin{bmatrix} y_{1} \\ \vdots \\ y_{N_{r}} \end{bmatrix}} = {{\frac{1}{\sqrt{N_{t}}}\left( {\sum\limits_{v = 1}^{N_{r}}\quad {D_{H}^{(v)}\left( D_{H}^{(v)} \right)}^{*}} \right)^{\frac{1}{2}}\Theta \quad s} + \eta}}},} & (25) \end{matrix}$

[0085] where η :=G|ζ₁ ^(T), . . . , ζ_(Nr) ^(T]) ^(T). Thanks to A5), it can be verified that G satisfies GG^(H)=I. Since the ζ_(ν)'s are i.i.d. AWGN noise vectors, the noise vector η retains their whiteness.

[0086] Following MRC, we split z into N_(g) groups: $\begin{matrix} {{z_{g} = {{\frac{1}{\sqrt{N_{t}}}D_{H,g}\Theta_{sub}\quad s_{g}} + \eta_{g}}},\quad {\forall{g \in \left\lbrack {0,{N_{g} - 1}} \right\rbrack}},} & (26) \end{matrix}$

[0087] where z_(g) :=[[z]_(g),[z]_(N) _(sub) _(+g), . . . , [z]_(N) _(sub) _((Ng−1)+g)]^(T), D_(H,g) is the corresponding diagonal sub-matrix from $\left( {\sum\limits_{v = 1}^{N_{r}}\quad {D_{H}^{(v)}\left( D_{H}^{(v)} \right)}^{*}} \right)^{\frac{1}{2}}$

[0088] for the gth group; and similarly defined, η_(g) is the corresponding AWGN noise vector. Maximum likelihood (ML) decoding can, for example, be implemented by applying a Sphere Decoding (SD) algorithm of sub-blocks z_(g) of small size N_(sub). Compared to the exponentially complex ML decoder, the SD offers near-ML performance at complexity that is polynomial in N_(sub),

(N ^(_(sub)) ^(α)). The SD complexity depends on the block size N_(sub), but unlike ML, it is independent of the constellation size.

[0089]FIG. 2A is a flowchart that illustrates operation of the DPS-based space-time multipath techniques describe herein. For exemplary purposes, the operation is described in reference to FIG. 1.

[0090] Given N_(t), N_(r) and Q, transmitter 4 selects the number of groups N_(g), and the corresponding group size N_(sub) depending on affordable complexity; and selects N=P=K=N_(g)N_(sub)>N_(t)(Q+1) (step 40).

[0091] Outer (OSTDO) coder 16 applies the N_(sub)×N_(sub) linear constellation precoder Θ_(sub) to form a precoded data stream, i.e., the precoded vectors u, according to equations (19)-(21) (step 42). Middle STDO (MSTDO) coder 17 splits the power of u to form mirrored precoded data streams c_(μ)=^(u{square root}{square root over (N)}) ^(_(t)) (step 44).

[0092] Inner STDO coders 22 apply DPS via Φ_(μ), and transmit v_(μ)=Φ_(μ)c_(μ), ∀μ∈ [1, N_(t)] (step 46). In particular, transmitter 4 has the knowledge of the upper-bound of the number of bases for the time-varying channels from transmitter 4 to receiver 6. ISTDO coders 22 process the precoded data streams so that the channels from transmitter 4 to receiver 6 can be equivalently viewed as one channel with more bases. In particular, ISTDO coders 22 compute a single channel vector from doppler offsets for the channels, and processes the mirrored precoded data streams with the single channel vector to shift the delay lag of each of the channels so that channel taps become consecutive within a Fast Fourier Transform (FFT) grid. Finally, transmitter 4 modulates each block v_(μ) to produce a transmission waveform via transmission antennas 20 (step 48).

[0093] Receiver 6 receives a waveform via receive antennas 28, and demodulates the received waveform (step 50). Next, receiver 6 performs MRC of blocks from all of the receive antennas 28 as in equation (25) (step 52). Finally, receiver 6 splits the MRC output block into Ng groups (step 64), and implements a scheme, e.g., ML or Sphere, to decode each reduced size group as in equation (26) to provide the estimated data (step 56). The performance of system 2 is a function of the sub-block size N_(sub), and when N_(sub)≧r_(h), the maximum diversity order in (12) is achieved. However, when N_(sub)<r_(h), the achieved diversity order is N_(sub).

[0094] The diversity gain for the STDO techniques described herein can be summarized in the following proposition:

[0095] Proposition 2 The maximum achievable STDO diversity order G_(d)=r_(h) is guaranteed by our DPS design when the group size is selected as N_(sub)≧N_(t)(Q+1). When the channel correlation matrix R_(h) has full rank r_(h)=N_(r)N_(t)(Q+1), our DPS design enables also the maximum possible coding gain among all linearly coded transmissions that is given in closed form by: $G_{c}^{\max} = {\left( {\det \left( R_{h} \right)} \right)^{\overset{\bot}{r_{h}}}{d_{\min}^{2}/{N_{t}.}}}$

[0096] Transmission rate 1 symbol/sec/Hz is achieved by DPS design.

[0097] In fact, the group size N_(sub) controls the tradeoff between performance and decoding complexity. When N_(sub)≦N_(t)(Q+1), as N_(sub) decreases, the decoding complexity decreases, while at the same time, the diversity order decreases. By adjusting N_(sub), we can balance the affordable complexity with the required performance.

[0098] The described DPS scheme utilizes channel knowledge at the receiver. As described DPS converts the multi-input single output (MISO) channel corresponding to each receive-antenna to an equivalent single-input single-output (SISO) system. As a result, existing SISO training algorithms can be utilized with the described techniques. The following describes a PSAM training method that may be used with the described GLCP-DPS transmission.

[0099] Initially, the BEM coefficients are estimated per block of N symbols. Starting from (19), we select one group s_(g) to serve as the pilot group. Without loss of generality, we select this group to be the first one, and design it as:

s₀=[b, b, . . . , b]_(N) _(sub) _(×1) ^(T).  (27)

[0100] After precoding the remaining groups as before, and interleaving among all the groups, the transmitted block u becomes:

u=[b,[u₁]₀, . . . , [u_(N) _(g) ⁻¹]₀;b, . . . ; b,[u₁]_(N) _(sub) ⁻¹, . . . , [u_(N) _(g) ⁻¹]_(N) _(sub) ⁻¹]^(T).  (28)

[0101] At the receive filter output, samples are collected that depend only on the pilot symbols. The resulting input-output relationship can be expressed as: $\begin{matrix} {{x_{v,b} = {{\frac{b}{\sqrt{N_{t}}}D_{H,b}^{(v)}1} + \zeta_{v,b}}},{\forall{v \in \left\lbrack {1,N_{r}} \right\rbrack}},} & (29) \end{matrix}$

[0102] where D_(H,b) ^((ν)) contains the channel entries from D_(H) ^((ν)) that correspond to the pilot slots, 1 is a vector with all-ones, and ζ_(ν,b) is the corresponding noise vector. Recalling (18), it can be verified that $\begin{matrix} {{{D_{H,b}^{(v)}1} = {{\sum\limits_{q = 0}^{{N_{t}{({Q + 1})}} - 1}\quad {h_{q}^{(v)}\omega_{q,b}}} = {\Omega_{b}h^{(v)}}}},} & (30) \end{matrix}$

[0103] where Ω_(b) :=[w_(0,b) . . . w_(Nt(Q+1)−1,b)], and w_(q,b) :=[1, exp(jw_(q)N_(g)), . . . , exp(jw_(q)N_(g)(N_(sub)−1))]^(T). Substituting (30) into (29), we obtain $\begin{matrix} {{x_{v,b} = {{\frac{b}{\sqrt{N_{t}}}\Omega_{b}h^{(v)}} + \zeta_{v,b}}},{\forall{v \in {\left\lbrack {1,N_{r}} \right\rbrack.}}}} & (31) \end{matrix}$

[0104] The linear minimum mean square error (LMMSE) channel estimator for the νth receive-antenna is: $\begin{matrix} {{{\hat{h}}^{(v)} = {\frac{b^{*}}{\sigma_{Ϛ}^{2}\sqrt{N_{t}}}\left( {R_{h^{(v)}}^{- 1} + {\frac{{b}^{2}}{\sigma_{Ϛ}^{2}N_{t}}\Omega_{b}^{\mathcal{H}}\Omega_{b}}} \right)^{- 1}\Omega_{b}^{\mathcal{H}}x_{v,b}}},{\forall{v \in \left\lbrack {1,N_{r}} \right\rbrack}},} & (32) \end{matrix}$

[0105] and the mean square error of ĥ^((ν)) is $\begin{matrix} {\sigma_{{\hat{h}}^{(v)}\quad}^{2} = {{{tr}\left( \left( {R_{h^{(v)}}^{- 1} + {\frac{{b}^{2}}{\sigma_{\zeta}^{2}N_{t}}\Omega_{b}^{\mathcal{H}}\Omega_{b}}} \right)^{- 1`} \right)}.}} & (33) \end{matrix}$

[0106] When N_(sub)≧N_(t)(Q+1), thanks to the equi-spaced placement of pilot symbols, we have Ω_(b) ^(H)Ω_(b)=N_(sub)I_(Nt(Q+1)). Suppose we fix the total power allocated to pilot symbols; i.e., |b|²=P_(b)/N_(sub), and P_(b) is fixed. Then (33) can be simplified to $\begin{matrix} {\sigma_{{\hat{h}}^{(v)}\quad}^{2} = {{{tr}\left( \left( {R_{h^{(v)}}^{- 1} + {\frac{_{b}}{\sigma_{\zeta}^{2}N_{t}}I_{N_{t}{({Q + 1})}}}} \right)^{- 1`} \right)}.}} & (34) \end{matrix}$

[0107] Eq. (34) confirms that the more power we allocate to pilot symbols, the more reliable our channel estimator is. For a fixed power P_(b), as the number of transmit-antennas increases, σ_(h) _(^((ν))) ² increases. Eqs. (32) and (34) provide a reliable training-based channel estimator and its variance, that is needed for realizing our DPS-based STDO scheme. Optimizing the training design also from a capacity perspective will be one of our future topics.

[0108] In the described STDO coding scheme, inner STDO coders 22 and inner STDO decoders 32 transform the time-selective channels into frequency-selective channels, e.g., by means of FFT and IFFT operations. The middle and outer coders 17, 16, respectively, can be used to implement orthogonal space-time multipath (STDO) designs to achieve the maximum diversity, and large coding gains. The following describes the duality between our finite basis expansion model for time-selective channels, and the finite impulse response (FIR) tapped delay model for frequency-selective channels, as further described in U.S. patent application Ser. No. ______, entitled “SPACE-TIME MULTIPATH CODING SCHEMES FOR WIRELESS COMMUNICATION SYSTEMS,” filed Apr. 21, 2003, having Attorney Docket No. 1008-007US01, the entire content of which is incorporated herein by reference.

[0109] Because circulant matrices can be diagonalized by (I)FFT matrices, and that the BEM described in (4) is based on the FFT grid, we can rewrite D_(H) ^((ν,μ)) as $\begin{matrix} {{D_{H}^{({v,\mu})} = {{\sum\limits_{q = 0}^{Q}\quad {h_{q}^{({v,\mu})}D_{q}}} = {F_{N}H^{({v,\mu})}F_{N}^{\mathcal{H}}}}},} & (35) \end{matrix}$

[0110] where H^((ν,μ)) is a circulant N×N matrix with first column [h_(Q/2)^((v, μ))⋯  h₀^((v, μ))0⋯  0  h_(Q)^((v, μ))⋯  h_(Q/2 + 1)^((v, μ))]^(T),

[0111] and F_(N) denotes the N-point Fast Fourier Transformation (FFT) matrix with (m+1, n+1)st entry [F_(N)]_(m,n)=1/{square root}{square root over (N)})e^(−j2πmn/N). If we now design the inner STDO codec in FIG. 1 as

Φ_(μ)=F_(N), ∀μ∈[1, N_(t)], and Γ_(ν)=F_(N) ^(H), ∀ν∈[1, N_(r)],  (36)

[0112] then based on (3), (35) and (36), we obtain $\begin{matrix} \begin{matrix} {y_{v} = {{F_{N}^{\mathcal{H}}x_{v}} = {{\sum\limits_{\mu = 1}^{N_{t}}\quad {F_{N}^{\mathcal{H}}D_{H}^{({v,\mu})}F_{N}c_{\mu}}} + {F_{N}^{\mathcal{H}}\zeta_{v}}}}} \\ {{= {{\sum\limits_{\mu = 1}^{N_{t}}{H^{({v,\mu})}c_{\mu}}} + \eta_{v}}},\quad {\forall{v \in {\left\lbrack {1,N_{r}} \right\rbrack.}}}} \end{matrix} & (37) \end{matrix}$

[0113] Equations (35)-(37) suggest that due to the described BEM, it is possible to convert the diagonal time-selective channel D_(H) ^((ν,μ)) to a circulant matrix after IFFT and FFT operations. The Q+1 BEM coefficients are dual to the channel taps of a frequency-selective channel. Hence, the inner STDO codec of system 2 is capable of transforming multi-antenna ST time-selective channels into ST frequency-selective channels. This time-frequency duality on channel models can be summarized in the following:

[0114] Property 2: Based on the BEM in (1) for time-selective channels, a block transmission over time-selective channels can be equivalently viewed as a transmission over frequency-selective channels after FFT processing at the transmitter, and IFFT processing at the receiver. An equivalent diagonal (or circulant) channel matrix can be generated either from a time-selective, or, from a frequency-selective channel with appropriate (I)FFT operations.

[0115] In order to achieve the maximum diversity gain r_(h), we can adopt some of the existing Space-Time-Multipath (STM) codecs as our middle and outer STDO codecs. In the following, a low-complexity CP-based approach, and a high-performance Zero Padding (ZP) based approach.

[0116] In the CP-based approach, the middle STDO codec consists of two stages. The first stage implements ST block coding, that is used to collect the spatial diversity. The second stage implements a GLCP-OFDM-based module to collect the Doppler (now viewed as multipath) diversity.

[0117] The ST block coding stage comprises an extension of the generalized complex orthogonal design (GCOD) for flat channels to time-selective channels. Consider splitting u into N_(s) equally long sub-blocks of size N_(sub) as the input of GCOD; i.e., K=N_(s)N_(sub). Define the size of the output of GCOD as: N_(d)N_(sub). Therefore, the rate of ST block code is N_(s)/N_(d). Out ST block code matrix is: $\begin{matrix} {{C_{{({N_{d}N_{sub}})} \times N_{t}} = {\sum\limits_{i = 0}^{N_{s} - 1}\quad \left( {{A_{i} \otimes u_{i}} + {B_{i} \otimes u_{i}^{*}}} \right)}},} & (38) \end{matrix}$

[0118] where u_(i) :=[[u]_(N) _(sub) i, . . . , [u]_(N) _(sub) (i+1)−1]^(T), and the real matrices {A_(i) ∈

^(N) ^(_(d)) ^(×N) ^(_(t)) , B_(i) ∈

^(N) ^(_(d)) ^(×N) ^(_(t)) , ∀i ∈ [0, N_(s)−1]}, satisfy the following properties: $\begin{matrix} \begin{matrix} {{{A_{i}^{T}A_{i^{\prime}}} + {B_{i}^{T}B_{i^{\prime}}}} = {\frac{1}{N_{t}}I_{N_{t}}{\delta \left( {i - i^{\prime}} \right)}}} \\ {{{A_{i}^{T}B_{i^{\prime}}} = 0},\quad {\forall i},{i^{\prime} \in {\left\lbrack {0,{N_{s} - 1}} \right\rbrack.}}} \end{matrix} & (39) \end{matrix}$

[0119] The symbols of the μth column of C are directed to the μth transmit-antenna.

[0120] Thanks to the FFT inner codec, the time-selective channel is converted to a frequency-selective channel. Dealing now with a frequency-selective channel, the second stage of our middle STDO codec forms an OFDM-based block transmission. The advantage of invoking an OFDM-structure here is two-fold: i) to cope with interblock interference (IBI) so that ST block codes can be decoded in block-form; and ii) to diagonalize the channel so that out low-complexity GLCP-based codec can be used in the outer STDO encoder.

[0121] After the first stage of ST block coding, an IFFT is performed and the CP is added, to each sub-block with length N_(sub). In matrix form, these operations can be described as:

[c₁ . . . c_(Nt)]=ρ(I_(Nd){circle over (x)}T_(cp))(I_(Nd){circle over (x)}F_(N) _(sub) ^(H))C,  (40)

[0122] where $\rho = \sqrt{N_{sub}/\left( {N_{sub} + Q} \right)}$

[0123] is a power-normalizing constant, and T_(cp) :=[T₁, I_(N) _(sub) , T₂]^(T), is a matrix implementing the CP insertion, with

T₁ :=[0_((Q/2)×(N) _(sub) _(−Q/2)), I_(Q/2)]^(T), and T₂ :=[I_(Q/2),0_((Q/2)×(N) _(sub) _(−Q/2))]^(T).

[0124] Correspondingly, at the receiver, we design the middle STDO decoder {overscore (M)}(·) following the reverse order of the two encoding stages. Specifically, we remove the CP and perform FFt by pre-multiplying with (I_(N) _(d) {circle over (x)}F_(N) _(sub) )(I_(N) _(d) {circle over (x)}R_(cp)) the received block on each antenna, where R_(cp) :=[0_(N) _(sub) _(×(Q/2)),I_(N) _(sub) ,0_(N) _(sub) _(×(Q/2)] is a matrix description of the CP removal operation. Recalling ()37), and our inner codec, we infer that the equivalent channel matrix facing the middle STDO codec is a circulant matrix H^((ν,μ)). With the OFDM module, the equivalent channel becomes: $\begin{matrix} \begin{matrix} {{{\left( {I_{N_{d}} \otimes F_{N_{sub}}} \right)\left( {I_{N_{d}} \otimes R_{cp}} \right){H^{({v,\mu})}\left( {I_{N_{d}} \otimes T_{cp}} \right)}\left( {I_{N_{d}} \otimes F_{N_{sub}}^{\mathcal{H}}} \right)} = {I_{N_{d}} \otimes {\overset{\_}{D}}_{H}^{({v,\mu})}}},} \\ {{{{where}\quad {\overset{\_}{D}}_{H}^{({v,\mu})}}:={{diag}\left\lbrack {{H^{({v,\mu})}(0)},\ldots \quad,{H^{({v,\mu})}\left( {N_{sub} - 1} \right)}} \right\rbrack}},{{{and}\quad {H^{({v,\mu})}(m)}}:={\sum\limits_{q = 0}^{Q}\quad {h_{q}^{({v,\mu})}{^{{- j}\frac{2\quad \pi \quad \eta}{N_{sub}}m}.}}}}} \end{matrix} & (41) \end{matrix}$

[0125] To decode the ST block code, we need to simplify our input-output relationship using (41). Based on (37) and (41), after CP removal and FFT processing, we obtain $\begin{matrix} \begin{matrix} {{{\overset{\_}{y}}_{v}:} = {\left( {I_{N_{d}} \otimes F_{N_{sub}}} \right)\left( {I_{N_{d}} \otimes R_{cp}} \right)y_{v}}} \\ {{{= {{\rho {\sum\limits_{\mu = 1}^{N_{t}}\quad {\left( {I_{N_{d}} \otimes {\overset{\_}{D}}_{H}^{({v,\mu})}} \right)\lbrack C\rbrack}_{\mu}}} + {\left( {I_{N_{d}} \otimes F_{N_{sub}}} \right)\left( {I_{N_{d}} \otimes R_{cp}} \right)\eta_{v}}}},}} \end{matrix} & (42) \end{matrix}$

[0126] where [C]_(μ) stands for the μth column of C. Plugging [C]_(μ) into (38), we rewrite {overscore (y)}_(ν) as: $\begin{matrix} {{{\overset{\_}{y}}_{v} = {{\rho {\sum\limits_{i = 1}^{N_{s}}\left( {{\sum\limits_{\mu = 1}^{N_{t}}{\left\lbrack A_{i} \right\rbrack_{\mu} \otimes \left( {{\overset{\_}{D}}_{H}^{({v,\mu})}u_{i}} \right)}} + {\sum\limits_{\mu = 1}^{N_{t}}{\left\lbrack B_{i} \right\rbrack_{\mu} \otimes \left( {{\overset{\_}{D}}_{H}^{({v,\mu})}u_{i}^{*}} \right)}}} \right)}} + {\overset{\_}{\eta}}_{v}}},} & (43) \end{matrix}$

[0127] where {overscore (η)}_(ν):=(I_(N) _(d) {circle over (x)}F_(N) _(sub) )(I_(N) _(d) {circle over (x)}R_(ep))η_(ν), and [A_(i]) _(μ) and [B_(i]) _(μ) are the μth columns of A_(i) and B_(i), respectively.

[0128] Similar to the DPS decoding scheme, MRC is utilized to combine the received blocks from different antennas. Based on the orthogonality of A_(i)'s and B_(i)'s in (39), for each receive antenna, our decoding matrix is: $\begin{matrix} {{G_{i}^{(v)} = \left\lbrack {\sum\limits_{\mu = 1}^{N_{t}}{{\left\lbrack A_{i} \right\rbrack_{\mu}^{T} \otimes \left( {\overset{\_}{D}}_{H}^{({v,\mu})} \right)^{*}}{\sum\limits_{\mu = 1}^{N_{t}}{\left\lbrack B_{i} \right\rbrack_{\mu}^{T} \otimes {\overset{\_}{D}}_{H}^{({v,\mu})}}}}} \right\rbrack},\quad {\forall{i \in \left\lbrack {0,{N_{s} - 1}} \right\rbrack}},{v \in {\left\lbrack {1,N_{r}} \right\rbrack.}}} & (44) \end{matrix}$

[0129] To implement the MRC, we use the combiner: $\begin{matrix} {{G_{i} = {\sqrt{N_{t}}\quad {\left( {\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\overset{\_}{D}}_{H}^{({v,\mu})}\left( {\overset{\_}{D}}_{H}^{({v,\mu})} \right)}^{*}}} \right)^{- \frac{1}{2}}\left\lbrack {G_{i}^{(1)},\ldots \quad,G_{i}^{(N_{r})}} \right\rbrack}}},\quad {\forall{i \in {\left\lbrack {0,{N_{s} - 1}} \right\rbrack.}}}} & (45) \end{matrix}$

[0130] Here, for the CP-based scheme only, we need to modify A5) as follows: ${{\left. {A5}^{\prime} \right)\quad {Channels}\quad {\overset{\_}{D}}_{H}^{({v,\mu})}\quad {are}\quad {coprime}};{i.e.}},{{\det\left( {\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\overset{\_}{D}}_{H}^{({v,\mu})}\left( {\overset{\_}{D}}_{H}^{({v,\mu})} \right)}^{*}}} \right)} \neq 0.}$

[0131] Under A5′), we have G_(i)G_(i) ^(H)=I. At the receiver, the ith sub-block corresponding to u_(i) is $\begin{matrix} \begin{matrix} {z_{i} = {G_{i}\left\lbrack {{\overset{\_}{y}}_{1}^{T},{\overset{\_}{y}}_{1}^{\mathcal{H}},\cdots \quad,{\overset{\_}{y}}_{N_{r}}^{T},{\overset{\_}{y}}_{N_{r}}^{\mathcal{H}}} \right\rbrack}^{T}} \\ {{= {{{\rho \left( {\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\overset{\_}{D}}_{H}^{({v,\mu})}\left( {\overset{\_}{D}}_{H}^{({v,\mu})} \right)}^{*}}} \right)}^{\frac{1}{2}}u_{i}} + \xi_{i}}},{\forall{i \in \left\lbrack {0,{N_{s} - 1}} \right\rbrack}},} \end{matrix} & (46) \end{matrix}$

[0132] where ξ_(i) :=G_(i)[{overscore (η)}₁ ^(T),{overscore (η)}₁ ^(H), . . . , {overscore (η)}_(Nr) ^(T),{overscore (η)}_(Nr) ^(H)]^(T) is a circular AWGN vector.

[0133] The outer STDO encoder Θ is designed as

Θ=I_(Na){circle over (x)}{overscore (Θ)}.  (47)

[0134] The ith sub-block is precoded by {overscore (Θ)}; i.e., u_(i)={overscore (Θ)}s_(i), ∀i ∈[0, N_(s)−1]. As in the DPS design, in order to reduce the decoding complexity, we again pursue the design of {overscore (Θ)} in a grouped form. Since the equivalent channel matrix between z_(i) and s_(i) is diagonal, we can write the gth group of z_(i), defined as z_(i,g), as: $\begin{matrix} {{z_{i,g} = {{\frac{\rho}{\sqrt{N_{t}}}\left( {\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\overset{\_}{D}}_{H,g}^{({v,\mu})}\left( {\overset{\_}{D}}_{H,g}^{({v,\mu})} \right)}^{*}}} \right)^{\frac{1}{2}}\Theta_{sub}s_{i,g}} + \xi_{i,g}}},{\forall{i \in \left\lbrack {0,{N_{s} - 1}} \right\rbrack}},{g \in \left\lbrack {0,{N_{g} - 1}} \right\rbrack},} & (48) \end{matrix}$

[0135] where Θ_(sub) is an {overscore (N)}_(sub)×{overscore (N)}_(sub) matrix designed according to [24] with {overscore (N)}_(sub)=N_(sub)/N_(g). Again, ML decoding for s_(i,g) can be performed by using sphere-decoding with block size {overscore (N)}_(sub).

[0136] Based on (14), we can verify that out CP-based approach constitutes also a linearly coded transmission. When N_(sub)≧(Q+1), the maximum diversity order r_(h) is guaranteed. Furthermore, when r_(h)=N_(r)N_(t)(Q+1), and we select {overscore (N)}_(sub)=Q+1, the coding gain for this CP-based scheme satisfies [c.f. (15)]: $\begin{matrix} {{{\left( {\ln \quad 2} \right)\left( {\det \left( R_{h} \right)} \right)^{\frac{1}{r_{h}}}\frac{N_{sub}d_{\min}^{2}}{\left( {N_{sub} + Q} \right)N_{t}}} \leq G_{c} \leq {\left( {\det \left( R_{h} \right)} \right)^{\frac{1}{r_{h}}}\frac{N_{sub}d_{\min}^{2}}{\left( {N_{sub} + Q} \right)N_{t}}}},} & (49) \end{matrix}$

[0137] where the upper bound is achieved when {overscore (N)}_(sub)=Q+1 satisfies a certain algebraic property [24]. A proof for the diversity and coding gains for CP-based scheme is given in Appendix D. As N_(sub) increases (ρ→1), the coding gain of our CP-based design in (49) approaches the maximum coding gain in (15). The encoding and decoding processes of this CP-based approach are summarized in the block diagram of FIG. 4. And our results are collected in the following proposition:

[0138] Proposition 3 CP-based STDO block codes guarantee the maximum space-Doppler diversity G_(d)=r_(h), when {overscore (N)}_(sub)≧Q+1, and offer low (FFT based) sphere decoding complexity at the receiver. When the channel correlation matrix R_(h) has full rank N_(t)N_(r)(Q+1), the CP-based design achieves the maximum coding gain G_(c) ^(max) of linearly coded systems, asymptotically, as N_(sub) increases. The transmission rate of CP-based design is r_(stbc)N_(sub)/(N_(sub)+Q), where r_(stbe) is the rate of block ST codes.

[0139] In the ZP-based approach, zero padding (ZP) replaces the CP guard. Similar to the CP-based design, there are two stages of the middle STDO codec. The first stage implements the GCOD, which is similar to (38), while the second eliminates IBI by padding zeros after each sub-block.

[0140] A scalar GCOD can be extended to the block-based GCOD: $\begin{matrix} {{C_{N_{j}N_{sub} \times N_{t}} = {\sum\limits_{i = 0}^{N_{s} - 1}\quad \left\lbrack {{A_{i} \otimes u_{i}} + {B_{i} \otimes \left( {P_{1}u_{i}^{*}} \right)}} \right\rbrack}},} & (50) \end{matrix}$

[0141] where u_(i) is defined as in (50); P₁ is a time-reversal matrix with entries [P₁]_(p,q)=δ(p+q−N_(sub)−1); and the matrices {A_(i) ∈

^(Nd×Nt), B_(i) ∈

_(Nd×Nt), ∀i ∈[0, N_(s)−1]} are defined as in (39). As for the second stage of the middle STDO encoder, instead of inserting the CP as in Section V.A, we insert leading and trailing zeros in each sub-block. Based on the design of the inner codec in (36) and the middle STDO encoder, the input-output relationship from C to y_(ν) is: $\begin{matrix} {{y_{v} = {{\sum\limits_{\mu = 1}^{N_{t}}\quad {{H^{({v,\mu})}\left( {I_{N_{d}} \otimes T_{zp}} \right)}\lbrack C\rbrack}_{\mu}} + \eta_{v}}},} & (51) \end{matrix}$

[0142] where T_(zp) :=[0_(N) _(sub) _(×Q/2)I_(N) _(sub) 0_(N) _(sub) _(×Q/2)]^(T) implements the ZP insertion. We can verify that

H^((ν,μ))(I_(Nd){circle over (x)}T_(zp))=I_(Nd){circle over (x)}({overscore (H)}^((ν,μ))T_(zp)),  (52)

[0143] where the (N_(sub)+Q)×(N_(sub)+Q) circulant matrix {overscore (H)}^((ν,μ)) has the same structure as H^((ν,μ)). The outer STDO encoder Θ is selected here to be an identity matrix; i.e., u=s.

[0144] At the receiver, to decode the ST block code and combine the results from different receive antennas, we use the MRC matrix $\begin{matrix} {{G_{i}^{(v)} = \left\lbrack {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\left\lbrack A_{i} \right\rbrack_{\mu}^{T} \otimes \left( {\overset{\_}{H}}^{({v,\mu})} \right)^{\mathcal{H}}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {\left\lbrack B_{i} \right\rbrack_{\mu}^{T} \otimes \left( {{\overset{\_}{H}}^{({v,\mu})}P_{2}} \right)}}}} \right\rbrack},{\forall{i \in \left\lbrack {0,{N_{s} - 1}} \right\rbrack}},} & (53) \end{matrix}$

[0145] where P₂ is an (N_(sub)+Q)×(N_(sub)+Q) time reversal matrix. Two properties of time-reversal matrices will come handy at this point [26]:

[0146] P1) P₂T_(zp)=T_(zp)P₁;

[0147] P2) P₂=F_(N) _(sub) _(+Q) ^(H)F_(N) _(sub) _(+Q) ^(H)=F_(N) _(sub) _(+Q)F_(N) _(sub) _(+Q).

[0148] Using P1) and P2), we can verify by direct substitution that

P₂({overscore (H)}^((ν,μ))*T_(zp)P₁=F_(N) _(sub) _(+Q) ^(H)F_(N) _(sub) _(+Q) ^(H)({overscore (H)}(ν,μ))*F_(N) _(sub) _(+Q)F_(N) _(sub) _(+Q)T_(zp)=({overscore (H)}^((ν,μ)))^(H)T_(zp).  (54)

[0149] From the circulant structure of {overscore (H)}^((ν,μ)), it also follows that {overscore (H)}^((ν,μ))({overscore (H)}^((ν,μ)))^(H)=({overscore (H)}^((ν,μ)))^(H){overscore (H)}^((ν,μ)). Similar to A5) and A5′), before we define the matrix to combine the multiple receive antennas, we need the following assumption: ${{\left. {A5}^{''} \right)\quad {Channels}\quad H^{({v,\mu})}{are}\quad {coprime}};\quad {i.e.}},{{\det\left( {\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\overset{\_}{H}}^{({v,\mu})}\left( {\overset{\_}{H}}^{({v,\mu})} \right)}^{*}}} \right)} \neq 0.}$

[0150] Based on this commutativity and (54), by defining $\begin{matrix} {{G_{i} = {\sqrt{N_{t}}{\left( {\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\overset{\_}{H}}^{({v,\mu})}\left( {\overset{\_}{H}}^{({v,\mu})} \right)}^{\mathcal{H}}}} \right)^{- \frac{1}{2}}\left\lbrack {G_{i}^{(1)},\ldots \quad,G_{i}^{(N_{r})}} \right\rbrack}}},{\forall{i \in \left\lbrack {0,{N_{s} - 1}} \right\rbrack}},} & (55) \end{matrix}$

[0151] and combining the multiple receive antennas, we obtain $\begin{matrix} \begin{matrix} {z_{i} = {G_{i}\left\lbrack {y_{1}^{T},y_{1}^{\mathcal{H}},\ldots \quad,y_{N_{r}}^{T},y_{N_{r}}^{\mathcal{H}}} \right\rbrack}^{T}} \\ {{= {{\frac{1}{\sqrt{N_{t}}}\left( {\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}\quad {{\overset{\_}{H}}^{({v,\mu})}\left( {\overset{\_}{H}}^{({v,\mu})} \right)}^{\mathcal{H}}}} \right)^{\frac{1}{2}}T_{zp}s_{i}} + \xi_{i}}},{\forall{i \in {\left\lbrack {0,{N_{s} - 1}} \right\rbrack.}}}} \end{matrix} & (56) \end{matrix}$

[0152] To decode s_(i) from z_(i),

(·) can again rely on sphere-decoding implemented on blocks of size N_(sub).

[0153] The performance of the SP-based scheme can be analyzed. The Euclidean distance between distance between z_(i) and z′_(i) as: $\begin{matrix} {{{d^{2}\left( {z_{i},z_{i}^{\prime}} \right)} = {\frac{1}{N_{t}}{\sum\limits_{v = 1}^{N_{r}}\quad {\sum\limits_{\mu = 1}^{N_{t}}{{E_{i}h^{({v,\mu})}}}^{2}}}}},} & (57) \end{matrix}$

[0154] where E_(i) is a Toeplitz matrix generated by e_(i)=s_(i)−s′_(i). When r_(h)=N_(r)N_(t)(Q+1), we find that the coding gain in this is $\begin{matrix} {G_{c} = {\left( {\det \left( R_{h} \right)} \right)^{\frac{1}{r_{h}}}{\frac{d_{\min}^{2}}{N_{t}}.}}} & (58) \end{matrix}$

[0155] The coding and decoding processes for the ZP-based scheme are summarized in FIG. 5.

[0156] Proposition 4 ZP-based STDO block codes guarantee the maximim space-Doppler diversity G_(d)=r_(h), ∀N_(sub)>0. When the channel correlation matrix R_(h) has full rank N_(t)N_(r)(Q+1), the ZP-based design achieves the maximum coding gain G_(c) ^(max) of linearly coded systems. The transmission rate of ZP-based design is r_(stbc)N_(sub)/(N_(sub)+Q), where r_(stbc) is the rate of the block ST codes.

[0157] Comparing our three STDO designs, we note that: i) all schemes guarantee the maximum diversity gain; ii) DPS and ZP-based schemes achieve also the maximum coding gain, while the CP-based scheme achieves the maximum coding gain asymptotically (as N_(sub) increases); iii) to guarantee the maximum diversity gain, the CP-based scheme provides the lowest decoding complexity; iv) to deal with IBI, CP- and ZP-based approaches rely on CP or ZP guards, which consume extra bandwidth compared with DPS scheme that does not require any guard. Furthermore, together with GCOD design benefits, our CP- and ZP-based STDO codecs inherit also its limitation in suffering up to 50% rate loss, when N_(t)>2 antennas are signaling with complex constellations. Notwithstanding, the DPS attains full rate for any N_(t).

EXAMPLES

[0158] Test Case 1: To validate the BEM, we utilize the widely accepted Jakes' model, with a carrier frequency of f₀=900 MHz, and a mobile speed ν_(max)=96 km/hr. The transmitted block length is N=25. Two transmit-antennas (N_(t)=2) and one receive-antenna (N_(r)=1) is considered. Since we want to test the model matching and the diversity for different Q's, we select the symbol period T_(s)=Q/(2f_(max)N). We generate all multiple channels using this Jakes's model. At the transmitter, we adopt our DPS design based on the knowledge of Q and N_(t)=2. At the receiver, we consider two different scenarios: one uses the parameters generated by Jakes' model (corresponding curves are marked by “Jakes” in FIG. 6); and the other one uses the BEM coefficients to approximate the Jakes' model. The channel generated by the Jakes' model has 200 paths, while BEM approximates Jakes' model by Q+1 BEM coefficients. MMSE equalization is used for both scenarios. FIG. 6 depicts the performance results. We observe that; i) our DPS design enables spatial diversity gains even for systems adhering to the Jakes' model; ii) when Q is smnall (Q=2), model mismatch between the BEM and the Jakes' model causes an error floor; and iii) when Q is large, the BEM matches the Jakes' model well, and the BER performance improves considerably.

[0159] Test Case 2 (comparisons among the three STDO codecs); We compare DPS, CP-Based, and ZP-Based schemes with N_(t)=2 transmit antennas, Q+1=3 bases per channel, and BEM parameters that are i.i.d., Gaussian, with mean zero, and variance 1/(Q+1). We choose QPSK modulation for all these schemes. The number of information symbols per block is P=K=24. For DPS, the transmitted block length N=24, while for CP- and ZP-based schemes, the block length N=28 because of the CP and ZP guards, respectively. The linear precoder with grouping is employed for DPS and CP-based schemes with group sizes N_(sub)=6 and {overscore (N)}_(sub)=3, respectively. FIG. 7 depicts the BER performance of these three codecs. SD has been employed for all schemes. We observe that: i) from the slope of the BER curves for N_(r)=1, all three schemes guarantee the maximum diversity order G_(d) ^(max)=N_(t)(Q+1)=6; ii) with either N_(r)=1 or 2, the ZP-based scheme exhibits the best performance among the three; iii) compared with CP, the performance of DPS incurs about 0.5 dB loss at high SNR for N_(r)=1; and iv) as N_(r) increases, the performance difference among three schemes diminishes at high SNR.

[0160] When N_(t)>2, because of the ST block codes, CP- and ZP-based schemes will lose up to 50% rate. In contrast, the DPS scheme attains the full rate for any N_(t). FIG. 8 depicts the performance of our three STDO when N_(t)=4. For CP- and ZP-based schemes, we select the block ST code as in (38) which loses 50% rate. To maintain similar rates, we select QPSK for CP- and ZP-based schemes and BPSK for DPS with the same symbol power. The information block length is K=36. From FIG. 8, we observe that DPS outperforms both CP and ZP. Note that even in this case, CP- and ZP-based schemes have lower rate ((9/11) bit/sec/Hz) than DPS (1 bit/sec/Hz).

[0161] Test Case 3: In this example, we compare our DPS scheme with the smart-greedy code for (N_(t), N_(r))=(2,1). To maintain the same rate, we select BPSK for our DPS scheme. Each channel has Q+1=3 bases, and the channel coefficients are i.i.e. with mean zero and variance 1/(Q+1). First, we consider the uncoded setup. The information block length is K=P=30. The number of groups for DPS is N_(g)=5, so that these two schemes have comparable decoding complexity. FIG. 9 depicts the BER versus SNR comparison for the smart-greedy code, and our DPS (the solid lines). It is evident that DPS outperforms the “smart-greedy” coding because the former guarantees the full space-Doppler diversity.

[0162] Furthermore, we consider the coded case for both schemes. We select a (7,3) Reed-Solomon coder with block interleaving. The number of information bits is 90. Therefore, the length of the coded block of bits is 210. We select the depth of the block interleaver as 42. For the DPS design, we split the coded bits into 5 blocks. Each block is divided into 7 groups. The simulation results are shown in FIG. 9 (the dashed lines). Note that the DPS scheme still outperforms the smart-greedy codes remarkably.

[0163] Test Case 4 (correlated channels): In this example, we investigate the performance of our three schemes, when the channel coefficients are not i.i.d.. The carrier frequency is now f₀=2 GHz, and the maximum mobile speed is ν_(max)=160 km/hr. For these f₀ and ν_(max) values, we find that f_(max)≈296.3 Hz. The sampling period is defined as T_(s)=Q/(2f_(max)N). We generate each channel correlation matrix E[h^((ν,μ))(h^((ν,μ)))^(H)]=UΛ, where U is a (Q+1)×(Q_(real)+1) unitary matrix, and Λ is a (Q_(real)+1) diagonal matrix. The ith entry of ${{\Lambda \quad {{is}\quad\lbrack\Lambda\rbrack}_{i,i}} = {\gamma \left( {\pi \sqrt{f_{\max}^{2} - \left( {\left( {i - {2\quad Q_{real}}} \right)/\left( {KT}_{s} \right)} \right)^{2}}} \right)}^{- 1}},$

[0164] where γ is a normalizing factor. It is clear that the choice of entries of Λ reflects the underlying Doppler spectrum. We consider the channels corresponding to different antennas to be independent. Then we generate h^((ν,μ))=UΛ{overscore (h)}^((ν,μ)), where the entries of {overscore (h)}^((ν,μ)) are i.i.d. with zero mean and unit variance. We consider N_(t)=2 and N_(r)=1 for all schemes. We select Q=4 and Q_(real)=2. For the CP-based scheme, we still use the GLCP method with group size {overscore (N)}_(sub)=3, while for the DPS method, we select N_(sub)=6. The information block length for all schemes is K=36. Hence, for CP- and ZP-based schemes, the transmitted block length is N=44. We select BPSK modulation throughout this experiment. The rate for DPS and the smart-greedy code of [20] is 1 bit/sec/Hz, while the rate is (9/11) bits/sec/Hz for CP- and ZP-based schemes.

[0165]FIG. 10 depicts the BER performance for our three proposed schemes and the smart-greedy code. It can be seen that all our proposed schemes achieve full diversity (in this case it is G_(d)=6), and outperform the “smart-greedy” code. Compared with the CP-based and DPS schemes, the ZP-based scheme has about 1 dB gain at BER=10⁻⁴. However, note that both CP- and ZP-based schemes have lower rate than DPS.

[0166] Various embodiments of the invention have been described. We described a basis expansion model (BEM) to benchmark the performance of multi-antenna space-time coded transmissions over correlated time-selective fading MIMO channels. Specifically, we expressed in closed form the maximum achievable space-Doppler diversity gain in terms of the number of transmit-receive antennae and the number of bases. Furthermore, we quantified in closed-form the maximum possible coding gain for all linearly coded space-time transmissions, and found it to depend on the rank of the BEM coefficients' correlation matrix and the minimum Euclidean distance of the constellation used.

[0167] In addition to performance limits, the BEM enabled us to develop space-time-Doppler (STDO) coded designs capable of achieving (or approaching) these gains, using only knowledge of the maximum Doppler spread. We established two neat BEM properties that played an instrumental role in these designs: i) multiple (N_(t)) BEMs with Q+1 bases each, can be rendered mathematically equivalent to a single faster BEM with N_(t)(Q+1) bases, via a digital phase sweeping operation at the transmitters; and, ii) a BEM for time-selective channels is dual to a tapped delay line model for frequency-selective channels, which allows designs developed for one model to be used for the other, after incorporating appropriate FFT-based operations at the transmit-receive sides.

[0168] The first property led us to an STDO coded system based on a novel digital phase sweeping design, which collects the maximum joint space-Doppler diversity and large coding gains, while it facilitates application of SISO channel estimators, and affords a low-complexity modular implementation when working with linearly precoded small-size groups of symbols. Its unique feature is full rate (1 symbol/sec/Hz) operation, regardless of the constellation and the number of transmit-receive antennae. The second property showed us the way to adjust existing space-time coded designs maximizing space-multipath diversity over frequency-selective channels, to collect joint space-Doppler gains over our time-selective MIMO channel. Using the same property in the reverse direction, we established that the limits on coding gains we derived for the BEM, apply to space-time coded transmissions over frequency-selective MIMO channels as well. The multipath-inspired designs yielded space-time-Doppler coded block transmissions with cyclic prefix or zero padding guard intervals. The former system affords the lowest (FFT-based) complexity, while the latter exhibits the best performance. With two transmit-antennas they have full rate; but with more, they both suffer the same rate loss as space-time block orthogonal designs, with complex constellations.

[0169] All three designs were developed in a unifying framework that entails three-stages (outer-middle-inner) of encoding and decoding. Their relative strengths were delineated both analytically and with simulations that also compared them with an existing system. Both coded and uncoded transmissions were tested over i.i.d. and correlated channels, and confirmed that the proposed designs outperform existing alternatives as they exploit fully the joint space-Doppler diversity that becomes available with time-selective channels.

[0170] The described techniques can be embodied in a variety of receivers and transmitters including base stations, cell phones, laptop computers, handheld computing devices, personal digital assistants (PDA's), and the like. The devices may include a digital signal processor (DSP), field programmable gate array (FPGA), application specific integrated circuit (ASIC) or similar hardware, firmware and/or software for implementing the techniques. If implemented in software, a computer readable medium may store computer readable instructions, i.e., program code, that can be executed by a processor or DSP to carry out one of more of the techniques described above. For example, the computer readable medium may comprise random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), electrically erasable programmable read-only memory (EEPROM), flash memory, or the like. The computer readable medium may comprise computer readable instructions that when executed in a wireless communication device, cause the wireless communication device to carry out one or more of the techniques described herein. These and other embodiments are within the scope of the following claims. 

1. A wireless communication device comprising: a first coder that linearly precodes a data stream to produce a precoded data stream; a second coder that processes the precoded data stream in accordance with a doppler spread of time-selective communication channels to produce a transformed data stream; and an antenna to output a waveform in accordance with the transformed data stream.
 2. The wireless communication device of claim 1, wherein the second coder processes the precoded data stream in accordance with a Basis Expansion Model (BEM) for the channels to produce the transformed data stream.
 3. The wireless communication device of claim 2, wherein the second coder samples the data stream to collect blocks of frequency-domain samples, processes the collected blocks of samples to transform the frequency-domain samples to time-domain samples for the transformed data stream.
 4. The wireless communication device of claim 3, wherein the second coder collects blocks of Q+1 frequency-domain samples, wherein Q is a selected as a function of the doppler spread of the channels.
 5. The wireless communication device of claim 3, further comprising a modulator to process blocks of N symbols within the transformed data stream at a symbol period T_(s) to produce the waveform for transmission with the antennas, and wherein the second coder samples the precoded data stream with a period of 1/N*T_(s) to collect the samples.
 6. The wireless communication device of claim 5, wherein Q=2 * ┌f_(max)*T_(s)*N┐, where f_(max) represents the doppler spread of the channels.
 7. The wireless communication device of claim 5, further comprising a power splitter to produce a plurality of mirrored data streams from the transformed data stream; and wherein the antenna comprises one of a plurality of antennas to output waveforms in accordance with the mirrored data streams.
 8. The wireless communication device of claim 7, further comprising a digital phase sweeping module that computes a single channel vector from estimates of doppler offset for the channels, and process the mirrored data streams with the single channel vector to shift a basis of each of the channels so that the basis become consecutive within a Fast Fourier Transform (FFT) grid.
 9. The wireless communication device of claim 7, further comprising a modulator to modulate each mirrored data stream and produce the waveforms for transmission with the respective antennas.
 10. The wireless communication device of claim 1, the first coder comprises a linear constellation precoder.
 11. The wireless communication device of claim 1, wherein the first coder applies a unitary matrix to blocks of M symbols of the data stream.
 12. The wireless communication device of claim 1, wherein the waveform is a multi-carrier waveform.
 13. The wireless communication device of claim 1, wherein the waveform is single-carrier waveform.
 14. The wireless communication device of claim 1, wherein the first coder linearly precodes the data stream by applying a matrix to symbols blocks of the data stream, wherein the matrix has a size that is an integer function of the number of antennas and the doppler spread.
 15. The wireless communication device of claim 14, wherein the blocks include N symbols, where N is selected as a function of the number of antennas N_(t) and the doppler spread of the channels.
 16. The wireless communication device of claim 14, wherein the first coder divides each of the symbol blocks of the data stream into N_(g) groups, where each group has N_(sub) symbols, and N_(sub) is an integer function of the number of antennas and the doppler spread.
 17. The wireless communication device of claim 16, wherein the matrix applied by the linear precoder has a size of N_(sub)×N_(sub).
 18. The wireless communication device of claim 1, wherein the wireless communication device comprises one of a base station and a mobile device.
 19. A wireless communication device comprising: a demodulator that receives a waveform from a plurality of time-selective multipath communication channels and produces a demodulated data stream; and a decoder that decodes the demodulated data in accordance with a Basis Expansion Model (BEM) that parameterizes time-selective communication multi-path channels as a function of frequency-selective multi-path communication channels.
 20. The wireless communication device of claim 19, wherein the decoder applies an N×N matrix to the demodulated data, wherein the N is selected as a function of a doppler spread of the frequency-selective multi-path communication channels.;
 21. A method comprising: estimating a doppler spread for a plurality of channels from a transmitter to a receiver; applying a linear precoder to a data stream to form a precoded data stream; processing the precoded data stream in accordance with the doppler spread to produce a transformed data stream; and transmitting a waveform with an antenna in accordance with the transformed data stream.
 22. The method of claim 21, wherein processing the precoded data stream comprise processing the precoded data stream in accordance with a Basis Expansion Model (BEM) for the channels to produce the transformed data stream.
 23. The method of claim 21, wherein processing the precoded data stream comprises: sampling the data stream to collect blocks of frequency-domain samples; processing the collected blocks of samples to transform the frequency-domain samples to time-domain samples; and outputting the transformed data stream based on the time-domain samples.
 24. The method of claim 23, wherein sampling the precoded data stream comprises collecting blocks of Q+1 frequency-domain samples, wherein Q is a selected as a function of the doppler spread of the channels.
 25. The method of claim 23, further comprising modulating blocks of N symbols within the transformed data stream at a symbol period T_(s) to produce the waveform for transmission with the antennas.
 26. The method of claim 25, wherein sampling the precoded data stream comprises sampling the precoded data stream with a period of 1/N*T_(s) to collect the samples.
 27. The method of claim 25, wherein Q=2 * [f_(max)*T_(s)*N], where f_(max) represents the doppler spread of the channels.
 28. The method of claim 21, further comprising: splitting the power of the transformed data stream to produce a plurality of mirrored data streams; and transmitting the mirrored data stream with respective antennas.
 29. The method of claim 28, further comprising: computing a single channel vector from the estimated doppler offset; and processing the mirrored data streams with the single channel vector to shift a basis of each of the channels so that basis become consecutive within a Fast Fourier Transform (FFT) grid.
 30. The method of claim 21, wherein applying a linear precoder comprises applying a linear constellation precoder.
 31. The method of claim 21, wherein the waveform is a multi-carrier waveform.
 32. The method of claim 21, wherein the waveform is a single-carrier waveform.
 33. The method of claim 21, wherein applying a linear precoder comprises: selecting a block size N as a function of the number of antennas N_(t) and the doppler spread; and applying a matrix to symbol blocks of the data stream, wherein the matrix has a size that is selected as a function of the number of antennas and the doppler spread.
 34. The method of claim 33, wherein applying a linear precoder comprises: dividing each of the blocks of the data stream into N_(g) groups, where each group has N_(sub) symbols, and N_(sub) is selected as a function of the number of antennas and the doppler spread; and applying the matrix to each of the symbol groups within the blocks, wherein the matrix has a dimension that is a function of the number of symbols N_(sub) within the groups.
 35. The method of claim 34, wherein the size of the matrix is N_(sub)×N_(sub).
 36. A computer-readable medium comprising instructions to cause a programmable processor of a wireless communication device to: estimate a doppler spread for a plurality of channels from a transmitter to a receiver; apply a linear precoder to a data stream to form a precoded data stream; process the precoded data stream in accordance with the doppler spread to produce a transformed data stream; and transmit a waveform with an antenna in accordance with the transformed data stream.
 37. The computer-readable medium of claim 36, further comprising instructions to cause the programmable processor to process the precoded data stream comprise processing the precoded data stream in accordance with a Basis Expansion Model (BEM) for the channels to produce the transformed data stream.
 38. The computer-readable medium of claim 36, further comprising instructions to cause the programmable processor to: sample the data stream to collect blocks of frequency-domain samples; process the collected blocks of samples to transform the frequency-domain samples to time-domain samples; and output the transformed data stream based on the time-domain samples. 